Krylov-Based Model Order Reduction of Time-delay Systems
نویسندگان
چکیده
We present a model order reduction method which allows the construction of a reduced, delay free model of a given dimension for linear time-delay systems, whose characteristic matrix is nonlinear due to the presence of exponential functions. The method builds on the equivalent representation of the time-delay system as an infinite-dimensional linear problem. It combines ideas from a finite-dimensional approximation via a spectral discretization on the one hand, and a Krylov-Padé model reduction approach on the other hand. The method exhibits a good spectral approximation of the original model, in the sense that the smallest characteristic roots are well approximated and the non-converged eigenvalues of the reduced model have a favorable location, and it preserves moments at zero and at infinity. The spectral approximation is due to an underlying Arnoldi process that relies on building an appropriate Krylov space for the linear infinite-dimensional problem. The preservation of moments is guaranteed, because the chosen finite-dimensional approximation preserves moments and in addition, the space on which one projects is constructed in such a way that the preservation of moments carries over to the reduced model. The implementation of the method is dynamic, since the number of grid points in the spectral discretization does not need to be chosen beforehand and the accuracy of the reduced model can always be improved by doing more iterations. It relies on a reformulation of the problem involving a companion like system matrix and a highly structured input matrix, whose structure are fully exploited.
منابع مشابه
Markovian Delay Prediction-Based Control of Networked Systems
A new Markov-based method for real time prediction of network transmission time delays is introduced. The method considers a Multi-Layer Perceptron (MLP) neural model for the transmission network, where the number of neurons in the input layer is minimized so that the required calculations are reduced and the method can be implemented in the real-time. For this purpose, the Markov process order...
متن کاملOn the stability of Krylov-based order reduction using invariance properties of the controllability subspace
This article presents an algorithm to achieve stable reduced models using Krylov-based model order reduction for discrete time systems while matching a certain number of Markov parameters. By using the invariance properties of the controllability matrix suitable input and output Krylov subspaces are derived. The method is illustrated performing model reduction of four well-known benchmark probl...
متن کاملIntroduction to Krylov Subspace Methods in Model Order Reduction
In recent years, Krylov subspace methods have become popular tools for computing reduced order models of high order linear time invariant systems. The reduction can be done by applying a projection from high order to lower order space using the bases of some subspaces called input and output Krylov subspaces. The aim of this paper is to give an introduction into the principles of Krylov subspac...
متن کاملMoment Matching Theorems for Dimension Reduction of Higher-Order Dynamical Systems via Higher-Order Krylov Subspaces
Moment matching theorems for Krylov subspace based model reduction of higherorder linear dynamical systems are presented in the context of higher-order Krylov subspaces. We introduce the definition of a nth-order Krylov subspace Kn k ({Ai} n i=1;u) based on a sequence of n square matrices {Ai}i=1 and vector u. This subspace is a generalization of Krylov subspaces for higher-order systems, incor...
متن کاملTwo-Sided Arnoldi in Order Reduction of Large Scale MIMO Systems
In order reduction of high order linear time invariant systems based on two-sided Krylov subspace methods, the Lanczos algorithm is commonly used to find the bases for input and output Krylov subspaces and to calculate the reduced order model by projection. However, this method can be numerically unstable even for systems with moderate number of states and can only find a limited number of bior...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Matrix Analysis Applications
دوره 32 شماره
صفحات -
تاریخ انتشار 2011